The hexagonal versus the square lattice
نویسندگان
چکیده
منابع مشابه
The hexagonal versus the square lattice
Schmutz Schaller’s conjecture regarding the lengths of the hexagonal versus the lengths of the square lattice is shown to be true. The proof makes use of results from (computational) prime number theory. Using an identity due to Selberg, it is shown that, in principle, the conjecture can be resolved without using computational prime number theory. By our approach, however, this would require a ...
متن کاملThe square lattice shuffle
We show that the operations of permuting columns and rows separately and independently mix a square matrix in constant time.
متن کاملThe square lattice shuffle, correction
1. A CORRECTION Theorem 3.6 in [1] contains an error in the stated bound. As is argued above the theorem, the statistical distance to the uniform distribution decreases by a factor O ( (m/ log m)−1/2 ) = O ((log n)1/2n−1/4) for every two iterations. This implies that the bound obtained for Theorem 3.6 should read O ( n1− t−1 2 1 4 (log n) t−1 2 1 2 ) . I am grateful to Justin Holmgren for point...
متن کاملFolding the Square - Diagonal Lattice
We study the problem of " phantom " folding of the two-dimensional square lattice, in which the edges and diagonals of each face can be folded. The non-vanishing thermodynamic folding entropy per face s ≃ .2299(1) is estimated both analytically and numerically, by successively mapping the model onto a dense loop model, a spin model and a new 28 Vertex, 4-color model. Higher dimensional generali...
متن کاملDistance Coloring of the Hexagonal Lattice
Motivated by the frequency assignment problem we study the ddistant coloring of the vertices of an infinite plane hexagonal lattice H. Let d be a positive integer. A d-distant coloring of the lattice H is a coloring of the vertices of H such that each pair of vertices distance at most d apart have different colors. The d-distant chromatic number of H, denoted χd(H), is the minimum number of col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2003
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-03-01556-4